Computation of Shortest Paths on Free-Form Parametric Surfaces

نویسنده

  • Takashi Maekawa
چکیده

Computation of shortest paths on free-form surfaces is an important problem in ship design, robot motion planning, computation of medial axis transforms of trimmed surface patches, terrain navigation and NC machining. The objective of this paper is to provide an e cient and reliable method for computing the shortest path between two points on a free-form parametric surface and the shortest path between a point and a curve on a free-form parametric surface. These problems can be reduced to solving a two point boundary value problem. Our approach for solving the two point boundary value problem is based on a relaxation method relying on nite di erence discretization. Examples illustrate our method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of the shortest path between two curves on a parametric surface by geodesic-like method

In this paper, we present the geodesic-like algorithm for the computation of the shortest path between two objects on NURBS surfaces and periodic surfaces. This method can improve the distance problem not only on surfaces but in R. Moreover, the geodesic-like algorithm also provides an efficient approach to simulate the minimal geodesic between two holes on a NURBS surfaces.

متن کامل

Developments in the theory of randomized shortest paths with a comparison of graph node distances

There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation that the above-mentioned common distances in many situations fail to take into account the global structure of the graph. In this article, we develop the theo...

متن کامل

Generalized Unfoldings for Shortest Paths in Euclidean 3-Space

The problem of determining shortest paths in the presence of polyhedral obstacles between two points in Euclidean 3-space stems from the general problem of obtaining optimal coliision free paths in robot systems. For the special case when paths are constrained to the surfaces of 3-dimensional objects, simple planar unfoldings are used to obtain the shortest path. For the general case wben paths...

متن کامل

Iso-scallop tool path generation in 5-axis milling

This paper presents a new method of computing constant scallop height tool paths in 5-axis milling on sculptured surfaces. Usually, iso-scallop tool paths computation methods are based on approximations. The attempted scallop height is modelled in a given plane to ensure a fast computation of the tool path. We propose a different approach, based on the concept of the machining surface, which en...

متن کامل

Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm

We present a new algorithm recognizing general context-free languages in O(BM(n)) time, where BM(n) is the time to multiply two n by n boolean matrices. The only known algorithm for this problem with the same asymptotic complexity is the Valiant's algorithm [Va75], which is quite sofisticated. The probem related to texts is reduced to arithmetics of matrices whose elements are in a semiring of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002